- detailed routing
- деталізоване трасування
English-Ukrainian dictionary of microelectronics. 2013.
detailed routing
Смотреть что такое "detailed routing" в других словарях:
Routing (electronic design automation) — Routing is a crucial step in the design of integrated circuits. It builds on a preceding step, called placement, which determines the location of each active element of an IC. Routing is then the process of addingall wires needed to properly… … Wikipedia
Information Routing Group — An Information Routing Group (or IRG ) is one of a semi infinite set of similar interlocking and overlapping groups each IRG containing a group of ( maybe 3 to 200) individuals (IRGists) and each IRG loosely sharing a particular common interest;… … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
Satisfiability Modulo Theories — (SMT) problem is a decision problem for logical formulas with respect to combinations of background theories expressed in classical first order logic with equality. Examples of theories typically used in computer science are the theory of real… … Wikipedia
Monitoring and Measurement in the Next Generation Technologies — (MOMENT) is a project aimed at integrating different platforms for network monitoring and measurement to develop a common and open pan European infrastructure. The system will include both passive and active monitoring and measurement techniques… … Wikipedia
Link-state advertisement — The Link state advertisement (LSA) is a basic communication means of the OSPF routing protocol for IP. It communicates the router s local routing topology to all other local routers in the same OSPF area. OSPF is designed for scalability, so some … Wikipedia
Ant colony optimization algorithms — Ant behavior was the inspiration for the metaheuristic optimization technique. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be… … Wikipedia
Local number portability — This article is about telephone number portability on landlines. For telephone number portability on mobile phones, see Mobile number portability. Local number portability (LNP) for fixed lines, and full mobile number portability (FMNP) for… … Wikipedia
Peering — In computer networking, peering is a voluntary interconnection of administratively separate Internet networks for the purpose of exchanging traffic between the customers of each network. The pure definition of peering is settlement free or sender … Wikipedia
Border Gateway Protocol — BGP redirects here. For the Formula One Team, see Brawn GP. The Border Gateway Protocol (BGP) is the protocol backing the core routing decisions on the Internet. It maintains a table of IP networks or prefixes which designate network reachability … Wikipedia
operations research — the analysis, usually involving mathematical treatment, of a process, problem, or operation to determine its purpose and effectiveness and to gain maximum efficiency. [1940 45, Amer.] * * * Application of scientific methods to management and… … Universalium
